The unconstrained binary quadratic programming problem: a survey

In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application potential and its computational challenge. Research on UBQP has generated a wide range of solution techniques for this basic model that encompasses a rich collection of problem types. In this paperwe survey the literature on this importantmodel, providing an overview of the applications and solution methods. G. Kochenberger (B) School of Business Administration, University of Colorado at Denver, Denver, CO 80217, USA e-mail: [email protected] J.-K. Hao LERIA, Université d’Angers, 2 Boulevard Lavoisier, 49045 Angers, France e-mail: [email protected] F. Glover OptTek Inc., Boulder, CO 80302, USA e-mail: [email protected] M. Lewis Craig School of Business, Missouri Western State University, Saint Joseph, MO 64507, USA e-mail: [email protected] Z. Lü School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China e-mail: [email protected] H. Wang Sanchez School of Business, Texas A&M International University, Laredo, TX 78041, USA e-mail: [email protected] Y. Wang School of Management, Northwestern Polytechnical University, 127 Youyi West Road, Xi’an 710072, China e-mail: [email protected]